The Affine Hull of a Binary Automaton is Computable in Polynomial Time

We present the class of binary automaton, a new representation for the subsets of N that naturally extends the NDD ([25], [10]). We prove that the affine hull of the set of vectors represented by a binary automaton is computable in polynomial time. As application, we show that the set of place invariants [11] of a counter system (an extension of the Broadcast Protocols [16], [13], [12], the Reset/Transfer Petri Nets [15],[11] and the linear systems [18]), is computable in polynomial time.